A novel nonconvex approach to recover the low-tubal-rank tensor data: when t-SVD meets PSSV

نویسندگان

  • Tai-Xiang Jiang
  • Ting-Zhu Huang
  • Xi-Le Zhao
  • Liang-Jian Deng
چکیده

A recently developed novel tensor decomposition scheme named tensor singular value decomposition (t-SVD) results in a notion of rank referred to as the tubal-rank. Many methods minimize its convex surrogate the tensor nuclear norm (TNN) to enhance the low tubal-rankness of the underlying data. Generally, minimizing the TNN may cause some biases. In this paper, to alleviate these bias phenomenons, we consider to minimize the proposed partial sum of the tensor nuclear norm (PSTNN) in place of the TNN. The novel PSTNN is applied to the tasks of tensor completion and tensor principal component analysis. Numerical experiments are conducted on the synthetic data and real-world data, and experimental results reveal the effectiveness of the proposed methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low-tubal-rank Tensor Completion using Alternating Minimization

The low-tubal-rank tensor model has been recently proposed for real-world multidimensional data. In this paper, we study the low-tubal-rank tensor completion problem, i.e., to recover a third-order tensor by observing a subset of its elements selected uniformly at random. We propose a fast iterative algorithm, called Tubal-AltMin, that is inspired by a similar approach for low-rank matrix compl...

متن کامل

Exact Tensor Completion from Sparsely Corrupted Observations via Convex Optimization

This paper conducts a rigorous analysis for provable estimation of multidimensional arrays, in particular third-order tensors, from a random subset of its corrupted entries. Our study rests heavily on a recently proposed tensor algebraic framework in which we can obtain tensor singular value decomposition (t-SVD) that is similar to the SVD for matrices, and define a new notion of tensor rank re...

متن کامل

Face Recognition Based Rank Reduction SVD Approach

Standard face recognition algorithms that use standard feature extraction techniques always suffer from image performance degradation. Recently, singular value decomposition and low-rank matrix are applied in many applications,including pattern recognition and feature extraction. The main objective of this research is to design an efficient face recognition approach by combining many tech...

متن کامل

Multi-View Subspace Clustering via Relaxed L1-Norm of Tensor Multi-Rank

In this paper, we address the multi-view subspace clustering problem. Our method utilize the circulant algebra for tensor, which is constructed by stacking the subspace representation matrices of different views and then shifting, to explore the high order correlations underlying multi-view data. By introducing a recently proposed tensor factorization, namely tensor-Singular Value Decomposition...

متن کامل

Novel Factorization Strategies for Higher Order Tensors: Implications for Compression and Recovery of Multi-linear Data

In this paper we propose novel methods for compression and recovery of multilinear data under limited sampling. We exploit the recently proposed tensorSingular Value Decomposition (t-SVD)[1], which is a group theoretic framework for tensor decomposition. In contrast to popular existing tensor decomposition techniques such as higher-order SVD (HOSVD), t-SVD has optimality properties similar to t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1712.05870  شماره 

صفحات  -

تاریخ انتشار 2017